Quasi-concave Programming Quasi-concave Programming
نویسندگان
چکیده
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
منابع مشابه
A Note on Fuzzy Goal Programming with Nested Priorities
Rubin and Narsimhan [1984] proposed a method for formulating fuzzy priorities in goal programming. They used the concept that the membership function based on nested priorities has to be concave to solve the fuzzy goal programming problem by linear programming method. In this paper, we relax the condition of concave membership function by quasi concave membership function. We showed that the fu...
متن کاملMethod for solving quasi-concave and non-concave fuzzy multi-objective programming problems
This paper proposes a method based on linear programming techniques to treat quasi-concave and non-concave fuzzy multi-objective programming (FMOP) problems. The proposed method initially presents a piecewise linear expression to interpreting a quasi-concave membership function. Then we 7nd the convex-type break points and transform all quasiconcave membership functions into concave functions. ...
متن کاملRandom Fixed Points of M U Ltifu N Ctio N S in Games an D Dynam Ic Programming
Recently several authors demonstrated random fixed point theorems for various classes of multifunctions ([7], [8], [2], [3], [12], [10]). On the other hand we do not know any work on applications of these theorems. In this paper we apply to games and dynamic programming a random analogue of the Fan-Kakutani fixed point theorem. We consider a zero-sum two-person game depending on a random parame...
متن کاملProgramming under Probabilistic Constraints with a Random Technology Matrix
Probabilistic constraint of the type P (Ax ≤ β) ≥ p is considered and it is proved that under some conditions the constraining function is quasi-concave. The probabilistic constraint is embedded into a mathematical programming problem of which the algorithmic solution is also discussed.
متن کاملQuasi-Concave Functions and Greedy Algorithms
Many combinatorial optimization problems can be formulated as: for a given set system over E (i.e., for a pair (E, ) where ⊆ 2E is a family of feasible subsets of finite set E), and for a given function F : →R, find an element of for which the value of the function F is minimum or maximum. In general, this optimization problem is NP-hard, but for some specific functions and set systems the prob...
متن کامل